A topological property of rational ω-languages
نویسندگان
چکیده
منابع مشابه
Topological Complexity of Context-Free ω-Languages: A Survey
We survey recent results on the topological complexity of context-free ω-languages which form the second level of the Chomsky hierarchy of languages of infinite words. In particular, we consider the Borel hierarchy and the Wadge hierarchy of non-deterministic or deterministic context-free ω-languages. We study also decision problems, the links with the notions of ambiguity and of degrees of amb...
متن کاملComplexity of Topological Properties of Regular ω-Languages
We determine the complexity of topological properties (i.e., properties closed under the Wadge equivalence) of regular ω-languages by showing that they are typically NL-complete (PSPACEcomplete) for the deterministic Muller, Mostowski and Büchi automata (respectively, for the nondeterministic Rabin, Muller, Mostowski and Büchi automata). For the deterministic Rabin and Streett automata and for ...
متن کاملPrognosis of ω-languages for the Diagnosis of ∗-languages: A Topological Perspective
This article offers a novel perspective on the diagnosis of ∗-languages via a topological characterization of ω-languages. This allows for the different concepts that currently exist in diagnosis of discrete-event systems to be related to one another in a uniform setting and to study their complexity. For this purpose, we introduce the notion of prognosability of an ω-language, which in the cla...
متن کاملω-rational Languages: High Complexity Classes vs. Borel Hierarchy
The paper investigates classes of languages of in nite words with respect to the acceptance conditions of the nite automata recognizing them. Some new natural classes are compared with the Borel hierachy. In particular, it is proved that (fin,=) is as high as Fσ and G R δ . As a side e ect, it is also proved that in this last case, considering or not considering the initial state of the FA make...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00046-y